Single-machine common due window assignment and scheduling to minimize the total cost

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness

This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem Pm|di = d| ∑ wiTi. A new dynamic...

متن کامل

Single Machine Group Scheduling with Setups to Minimize Total Tardiness

This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...

متن کامل

Scheduling problems with a common due window assignment: A survey

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...

متن کامل

Common Due Window Scheduling with Both Time and Position Effects on a Single Machine

We consider the problem of common due window location scheduling on a single machine, where the processing times of jobs depend both on their starting times and positions in a sequence. The problem is to determine the optimal earliest due date, the due window size, and the job schedule simultaneously to minimize costs for earliness, tardiness, earliest due date assignment and due window size pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Optimization

سال: 2013

ISSN: 1572-5286

DOI: 10.1016/j.disopt.2012.10.003